2 5 A ug 2 00 9 Zero - one laws for connectivity in random key graphs ∗
نویسندگان
چکیده
The random key graph is a random graph naturally associated with the random key predistribution scheme of Eschenauer and Gligor for wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen recent work on this conjecture by Blackburn and Gerke [1]. In particular, the results are given under conditions which are more realistic for applications to wireless sensor networks.
منابع مشابه
Zero-One Laws for Connectivity in Random Key Graphs
The random key graph is a random graph naturally associated with the random key predistribution scheme introduced by Eschenauer and Gligor in the context of wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen ...
متن کاملk-Connectivity in Random Key Graphs With Unreliable Links
Random key graphs form a class of random intersec-tion graphs and are naturally induced by the random key predis-tribution scheme of Eschenauer and Gligor for securing wirelesssensor network (WSN) communications. Random key graphshave received much interest recently, owing in part to theirwide applicability in various domains including recommendersystems, social networks...
متن کاملMSO zero-one laws on random labelled acyclic graphs
We use Ehrenfeucht-type games to prove that Monadic Second Order logic admits labelled zero-one laws for random free trees, generating the complete almost sure theory. Our method will be to dissect random trees to get a picture of what almost all random free trees look like. We will use elementary (second moment) methods to obtain probability results. Abstract Key words: random labelled trees, ...
متن کاملConnectivity in Secure Wireless Sensor Networks under Transmission Constraints (CMU-CyLab-14-003)
In wireless sensor networks (WSNs), the Eschenauer–Gligor (EG) key pre-distribution scheme is a widely recognized way to secure communications. Although the connectivity properties of secure WSNs with the EG scheme have been extensively investigated, few results address physical transmission constraints. These constraints reflect real–world implementations of WSNs in which two sensors have to b...
متن کاملA ug 2 00 5 Estimation of a Covariance Matrix with Zeros ∗
We consider estimation of the covariance matrix of a multivariate random vector under the constraint that certain covariances are zero. We first present an algorithm, which we call Iterative Conditional Fitting, for computing the maximum likelihood estimator of the constrained covariance matrix, under the assumption of multivariate normality. In contrast to previous approaches, this algorithm h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009